Linear time algorithm for Precedence Constrained Asymmetric Generalized Traveling Salesman Problem
نویسندگان
چکیده
منابع مشابه
A Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints a Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints
In this article we consider a variant of the classical asymmetric traveling salesman problem (ATSP), namely the ATSP in which precedence constraints require that certain nodes must precede certain other nodes in any feasible directed tour. This problem occurs as a basic model in scheduling and routing and has a wide range of applications varying from helicopter routing 25], sequencing in exible...
متن کاملMemetic Algorithm for the Generalized Asymmetric Traveling Salesman Problem
The generalized traveling salesman problem (GTSP) is an extension of the well-known traveling salesman problem. In GTSP, we are given a partition of cities into groups and we are required to find a minimum length tour that includes exactly one city from each group. The aim of this paper is to present a new memetic algorithm for GTSP which clearly outperforms the state-of-the-art memetic algorit...
متن کاملA Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints
In this article we consider a variant of the classical asymmetric traveling salesman problem (ATSP), namely the ATSP in which precedence constraints require that certain nodes must precede certain other nodes in any feasible directed tour. This problem occurs as a basic model in scheduling and routing and has a wide range of applications varying from helicopter routing [25], sequencing in flexi...
متن کاملAsymmetric Traveling Salesman Problem
The asymmetric traveling salesman problem (ATSP) is one of the most fundamental problems in combinatorial optimization. An instance of ATSP is a directed complete graph G = (V,E) with edge weights w : E → N that satisfy the triangle inequality, i. e., w(a, c) ≤ w(a, b) +w(b, c) for all distinct vertices a, b, c ∈ V . The goal is to find a Hamiltonian cycle of minimum weight. The weight of a Ham...
متن کاملSolving Precedence Constraint Traveling Salesman Problem using Genetic Algorithm
Traveling Salesman Problem (TSP) is an NP-hard Problem, which has so many different real life applications. Precedence Constraint TSP (PCTSP) is one specific type of TSP in which precedence is given to some cities. PCTSP also has numerous applications. Genetic Algorithms [1] are robust and probabilistic search algorithms based on the mechanics of natural selection and survival of fittest. This ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2016
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2016.07.767